An Improved Artificial Bee Colony Algorithm for Community Detection in Bipartite Networks

نویسندگان

چکیده

In the past few decades, although people have conducted in-depth research on community detection in one-mode networks, bipartite networks has not been extensively researched. this paper, we propose an improved artificial bee colony algorithm named IABC-BN, which is used to detect communities two-mode graphs (i.e. graphs) with two kinds of vertices cluster community). Firstly, paper proposed a novel population initialization process (ABC) method for graph identification. This can improve diversity initial ABC and speed up its convergence rate. Secondly, employed search step algorithm, new combinatorial equation proposed. guided by global optimal solution better neighbour current solution. By using combination increased parameter perturbation frequency, exploitation ability further enhanced. Thirdly, onlooker bees step, another also improves level opposition based studying promote algorithm. Lastly, scout stage, probability threshold $\beta $ introduced enhance exploration To our knowledge, IABC-BN presented first identification cluster. For verifying accuracy results method, large number experiments are carried out making use synthetic real graphs. The test outcomes show that excellent discovery graph.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved K-Means with Artificial Bee Colony Algorithm for Clustering Crimes

Crime detection is one of the major issues in the field of criminology. In fact, criminology includes knowing the details of a crime and its intangible relations with the offender. In spite of the enormous amount of data on offenses and offenders, and the complex and intangible semantic relationships between this information, criminology has become one of the most important areas in the field o...

متن کامل

Community Detection in Complex Networks Using Improved Artificial Bee Colony Algorithm

With more and more various systems in nature and society are proved to be modeled as complex networks, community detection in complex networks as a fundamental problem becomes a hot research topic in a large scale of subjects. Artificial Bee Colony Algorithm (ABC) has high efficiency and does not require any prior knowledge about the number or the original division of the communities. So it is ...

متن کامل

OPTIMIZATION OF RC FRAMES BY AN IMPROVED ARTIFICIAL BEE COLONY ALGORITHM

A new meta-heuristic algorithm is proposed for optimal design of reinforced concrete (RC) frame structures subject to combinations of gravity and lateral static loads based on ACI 318-08 design code. In the present work, artificial bee colony algorithm (ABCA) is focused and an improved ABCA (IABCA) is proposed to achieve the optimization task. The total cost of the RC frames is minimized during...

متن کامل

An Improved Memetic Search in Artificial Bee Colony Algorithm

Artificial Bee Colony (ABC) is a swarm optimization technique. This algorithm generally used to solve nonlinear and complex problems. ABC is one of the simplest and up to date population based probabilistic strategy for global optimization. Analogous to other population based algorithms, ABC also has some drawbacks computationally pricey due to its sluggish temperament of search procedure. The ...

متن کامل

Improved Onlooker Bee Phase in Artificial Bee Colony Algorithm

Artificial Bee Colony (ABC) is a distinguished optimization strategy that can resolve nonlinear and multifaceted problems. It is comparatively a straightforward and modern population based probabilistic approach for comprehensive optimization. In the vein of the other population based algorithms, ABC is moreover computationally classy due to its slow nature of search procedure. The solution exp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3050752